Each zein gene class can produce polypeptides of different sizes
نویسندگان
چکیده
منابع مشابه
Scorecard construction with unbalanced class sizes
A long-running issue in scorecard construction in retail banking is how to handle dramatically unbalanced class sizes. This is important because, in many applications, the class sizes are very different. We describe the impact ignoring such imbalance can have and review the various strategies which have been proposed for tackling it, embedding them in a common theoretical framework. We then des...
متن کاملDifferent pool sizes of the precursor polypeptides of cytochrome oxidase from Neurospora crassa.
Pulse-labelling experiments with growing Neurospora crassa revealed that the polypeptides composing the protein moiety of a cytochrome oxidase preparation are derived from at least four independent pools of precursor polypeptides. The pool sizes range from 2 ° f 0 to 25 °/0 of the amount of the corresponding polypeptide present in cytochrome oxidase. The smallest pool is assigned to a polypepti...
متن کاملA single pacemaker can produce different rates of reentrainment in different overt rhythms.
Using a simple Van der Pol oscillator, we show that periodic events triggered by different states of the oscillator can reentrain at different rates following a phase shift of the Zeitgeber. Such differences can emerge due to waveform distortion during reentrainment, due to masking and due to fitting procedures (e.g. acrophase determination). Therefore, different rates of reentrainment are cons...
متن کاملExchanging messages of different sizes
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of message exchange problems in asynchronous systems with a linear cost model and messages of arbitrary sizes. We extend previous complexity results to show that the general asynchronous problems are NP-complete. We present se...
متن کاملComparing Graphs of Different Sizes
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of independent sets, among other combinatorial quantities. Our methods involve inequalities for determinants, for traces of functions of operators, and for entr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The EMBO Journal
سال: 1985
ISSN: 0261-4189
DOI: 10.1002/j.1460-2075.1985.tb03746.x